Pattern recognition via projection-based kNN rules

نویسندگان

  • Ricardo Fraiman
  • Ana Justel
  • Marcela Svarc
چکیده

We introduce a new procedure for pattern recognition, based on the concepts of random projections and nearest neighbors. It can be thought as an improvement of the classical nearest neighbors classification rules. Besides the concept of neighbors we introduce the notion of district, a larger set which will be projected. Then we apply one dimensional k-NN methods to the projected data on randomly selected directions. In this way we are able to provide a method with some robustness properties and more accurate to handle high dimensional data. The procedure is also universally consistent. We challenge the method with the Isolet data where we obtain a very high classification score.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved KNN Algorithm for Imbalanced Data Based on Local Mean

KNN algorithm is a simple, effective, non-parametric classification, and has been widely used in text classification, pattern recognition, image and spatial classification. Research on improvements about KNN algorithm has broad application prospects and important scientific significance. Based on analysis about classic KNN and its improved algorithms, we find its over-reliance on the choice of ...

متن کامل

A Review of various k-Nearest Neighbor Query Processing Techniques

Identifying the queried object, from a large volume of given uncertain dataset, is a tedious task which involves time complexity and computational complexity. To solve these complexities, various research techniques were proposed. Among these, the simple, highly efficient and effective technique is, finding the K-Nearest Neighbor (kNN) algorithm. It is a technique which has applications in vari...

متن کامل

Manifold Matching for High-Dimensional Pattern Recognition

In pattern recognition, a kind of classical classifier called k-nearest neighbor rule (kNN) has been applied to many real-life problems because of its good performance and simple algorithm. In kNN, a test sample is classified by a majority vote of its k-closest training samples. This approach has the following advantages: (1) It was proved that the error rate of kNN approaches the Bayes error w...

متن کامل

A comparison of imputation methods for handling missing scores in biometric fusion

Multibiometric systems, which consolidate or fuse multiple sources of biometric information, typically provide better recognition performance than unimodal systems. While fusion can be accomplished at various levels in a multibiometric system, score-level fusion is commonly used as it offers a good tradeoff between data availability and ease of fusion. Most score-level fusion rules assume that ...

متن کامل

Survey of Nearest Neighbor Techniques

The nearest neighbor (NN) technique is very simple, highly efficient and effective in the field of pattern recognition, text categorization, object recognition etc. Its simplicity is its main advantage, but the disadvantages can’t be ignored even. The memory requirement and computation complexity also matter. Many techniques are developed to overcome these limitations. NN techniques are broadly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2010